Bureaucratic routines and error management in algorithmic systems
نویسندگان
چکیده
This article discusses how an analogy between algorithms and bureaucratic decision-making could help conceptualize error management in algorithmic systems. It argues that a view of as irreflexive processes is insufficient account errors complex public sector contexts, where operate jointly with other organizational work practices. To such the proposes be viewed analogous to more traditional routines organizations. Doing so helps clarify irreflexivity becomes problematic when coordination routine around automation fails. Thus, also challenges come concern wider context organized work. argument illustrated using known examples from critical literature on algorithms. Finally, drawing recent studies dynamics, formulates empirical research directions
منابع مشابه
PoLAPACK: parallel factorization routines with algorithmic blocking
LU, QR, and Cholesky factorizations are the most widely used methods for solving dense linear systems of equations, and have been extensively studied and implemented on vector and parallel computers. Most of these factorization routines are implemented with blockpartitioned algorithms in order to perform matrix-matrix operations, that is, to obtain the highest performance by maximizing reuse of...
متن کاملSymbolic vs. Algorithmic Differentiation of GSL Integration Routines
Forward and reverse modes of algorithmic differentiation (AD) transform implementations of multivariate vector functions F : IR → IR as computer programs into tangent and adjoint code, respectively. The adjoint mode is of particular interest in large-scale functions due to the independence of its computational cost on the number of free variables. The additional memory requirement for the compu...
متن کاملEfficient error-cancelling algorithmic ADC
An algorithmic ADC that is insensitive to capacitor mismatch and finite opamp gain and offset is described. Using the differential sampling scheme with the correlated double sampling (CDS) technique together, the virtually errorfree and fast multiply-by-two operation is obtained for the proposed ADC. For an N-bit converter, a new output word is obtained every 4N clock periods, and this represen...
متن کاملAlmost-everywhere Algorithmic Stability and Generalization Error
We introduce a new notion of algorithmic stability, which we call training stability. We show that training stability is sufficient for good bounds on generalization error. These bounds hold even when the learner has infinite VC dimension. In the PAC setting, training stability gives necessary and sufficient conditions for exponential convergence, and thus serves as a distribution-dependent ana...
متن کامل'Bureaucratic' set systems, and their role in phylogenetics
We say that a collection C of subsets of X is bureaucratic if every maximal hierarchy on X contained in C is also maximum. We characterize bureaucratic set systems and show how they arise in phylogenetics. This framework has several useful algorithmic consequences: we generalize some earlier results and derive a polynomial-time algorithm for a parsimony problem arising in phylogenetic networks....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hallinnon tutkimus
سال: 2021
ISSN: ['0359-6680', '2343-4309']
DOI: https://doi.org/10.37450/ht.107880